Minimum weight (T, d)-joins and multi-joins
نویسندگان
چکیده
منابع مشابه
Minimum $T$-Joins and Signed-Circuit Covering
Let G be a graph and T be a vertex subset of G with even cardinality. A T -join of G is a subset J of edges such that a vertex of G is incident with an odd number of edges in J if and only if the vertex belongs to T . Minimum T -joins have many applications in combinatorial optimizations. In this paper, we show that a minimum T -join of a connected graph G has at most |E(G)| − 1 2 |E( Ĝ )| edge...
متن کاملFaster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm called Stripe join for performing a join given a join index Stripe join is inspired by an algorithm called Jive join developed by Li and Ross Stripe join makes a single sequential pass through each input relation in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identi ers but no input tuples Stripe join pe...
متن کاملOn Packing T-Joins
A graft is a graph G = (V,E) together with a set T ⊆ V of even cardinality. A T-cut of G is an edge cut δ(X) for which |X ∩T | is odd. A T-join of G is a set of edges S ⊆ E with the property that a vertex of the graph (V, S) has odd degree if and only if it is in T . A T-join packing of G is a set of pairwise disjoint T-joins. Let τ(G) be the size of the smallest T-cut of G and let ν(G) be the ...
متن کاملFaster Joins , Self - Joins and
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross. Stripe-join makes a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identiiers but no input tuples. Stripe...
متن کاملFractional Packing of T-Joins
Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum fractional packing of T -joins. Padberg-Rao’s algorithm finds a minimum capacity T -cut but it does not produce a T -join packing, we present a polynomial combinatorial algorithm for finding an optimal T -join packing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00045-9